Machine Learning for Dynamic Incentive Problems
نویسندگان
چکیده
منابع مشابه
Machine learning for dynamic incentive problems∗
We propose a generic method for solving infinite-horizon, discrete-time dynamic incentive problems with hidden states. We first combine set-valued dynamic programming techniques with Bayesian Gaussian mixture models to determine irregularly shaped equilibrium value correspondences. Second, we generate training data from those pre-computed feasible sets to recursively solve the dynamic incentive...
متن کاملLearning in Dynamic Incentive Contracts
We derive the optimal dynamic contract in a continuous-time principal-agent setting, in which both investors and the agent learn about the firm’s profitability over time. Because investors learn about the firm’s future profitability from current output, which also depends upon the agent’s actions, deviations by the agent distort investors’ beliefs. We characterize the optimal contract, and show...
متن کاملEvaluating machine learning models for engineering problems
The use of machine learning (ML), and in particular, artiicial neural networks (ANN), in engineering applications has increased dramatically over the last years. However, by and large, the development of such applications or their report lack proper evaluation. Deecient evaluation practice was observed in the general neural networks community and again in engineering applications through a surv...
متن کاملProvable Algorithms for Machine Learning Problems
Modern machine learning algorithms can extract useful information from text, images and videos. All these applications involve solving NP-hard problems in average case using heuristics. What properties of the input allow it to be solved efficiently? Theoretically analyzing the heuristics is often very challenging. Few results were known. This thesis takes a different approach: we identify natur...
متن کاملGeometric Problems in Machine Learning
We present some problems with geometric characterizations that arise naturally in practical applications of machine learning. Our motivation comes from a well known machine learning problem, the problem of computing decision trees. Typically one is given a dataset of positive and negative points, and has to compute a decision tree that ts it. The points are in a low dimensional space, and the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3282487